Date: Tue, 14 Jan 1997 23:42:41 GMT
Server: NCSA/1.4.1
Content-type: text/html
Last-modified: Wed, 18 Sep 1996 17:52:29 GMT
Content-length: 1329

<html><head><title>Richard Cole</title>
<link rev="made" href="mailto:cole@cs.nyu.edu (Richard Cole*)">
</head>
<body>

<H2>Other Algorithm Papers</H2>

<p>
R. Cole, B. Mishra, J. Schmidt, A. Siegel.
On the dynamic finger conjecture for splay trees.
Part I: Splay sorting log n block sequences.
<cite>Courant Institute Technical Report</cite>, No. 700, 1995.
(Preliminary version, TR No. 471, 1989.)
<br>
<ul>
<li>
<!WA0><a HREF="http://cs.nyu.edu/Dienst/UI/2.0/Describe/ncstrl.nyu_cs%2fTR1995-700">abstract</a>
</li>
<li>
<!WA1><a HREF="http://cs.nyu.edu/Dienst/Repository/2.0/Body/ncstrl.nyu_cs%2fTR1995-700/postscript">postscript</a>
</li>
</ul>

<p>
R. Cole.
Part II: Finger searching.
<cite>Courant Institute Technical Report</cite>, No. 701, 1995.
(Preliminary version, TR No. 472, 1989.)
<br>
<ul>
<li>
<!WA2><a HREF="http://cs.nyu.edu/Dienst/UI/2.0/Describe/ncstrl.nyu_cs%2fTR1995-701">abstract</a>
</li>
<li>
<!WA3><a HREF="http://cs.nyu.edu/Dienst/Repository/2.0/Body/ncstrl.nyu_cs%2fTR1995-
701/postscript">postscript</a>
</li>
</ul>

<p>
R. Cole and R. Hariharan.
An O(n log n) algorithm for the maximum agreement subtree problem for
binary trees.
<cite>Proceedings of the Seventh
Annual ACM-SIAM Symposium on Discrete Algorithms</cite>,
1996, 323-332.
<br>
<ul>
<li>
<!WA4><a HREF="http://cs.nyu.edu/cs/faculty/cole/papers/CH96_ab.html">abstract</a>
</li>
</ul>

</body>
</html>

